Labeled Pyramids with Combinatorial Maps
نویسندگان
چکیده
Combinatorial Pyramids are defined as a stack of successively reduced combinatorial maps. The Pyramid construction plan defined in TR-63 [7] allows to describe a pyramid by two functions level and state defined respectively on the set of darts of the initial combinatorial map and the set of levels of the pyramid. These two functions encode respectively the maximum level on which a dart survives and the type of each reduction operation. Based on these functions any combinatorial map of the pyramid may be built from the base by a one pass algorithm scanning all the darts of the initial combinatorial map [7]. In this technical report we show that algorithms with a same sequential and parallel complexity may be designed in order to build all the reduced combinatorial maps of the Pyramid. 1This Work was supported by the Austrian Science Foundation under P14445MAT.
منابع مشابه
A First Step toward Combinatorial Pyramids in n-D Spaces
Combinatorial maps define a general framework which allows to encode any subdivision of an nD orientable quasi-manifold with or without boundaries. Combinatorial pyramids are defined as stacks of successively reduced combinatorial maps. Such pyramids provide a rich framework which allows to encode fine properties of the objects (either shapes or partitions). Combinatorial pyramids have first be...
متن کاملConnecing Walks and Connecting Dart Sequences for N-d Combinatorial Pyramids Connecting Walks and Connecting Dart Sequences for N-d Combinatorial Pyramids
Combinatorial maps define a general framework which allows to encode any subdivision of an n-D orientable quasi-manifold with or without boundaries. Combinatorial pyramids are defined as stacks of successively reduced combinatorial maps. Such pyramids provide a rich framework which allows to encode fine properties of objects (either shapes or partitions). Combinatorial pyramids have first been ...
متن کاملConnecting walks and connecting dart sequences for n-D combinatorial pyramids
Combinatorial maps define a general framework which allows to encode any subdivision of an n-D orientable quasi-manifold with or without boundaries. Combinatorial pyramids are defined as stacks of successively reduced combinatorial maps. Such pyramids provide a rich framework which allows to encode fine properties of objects (either shapes or partitions). Combinatorial pyramids have first been ...
متن کاملConnecting Walks and Connecting Dart Sequences in n-D Combinatorial Pyramids
Combinatorial maps define a general framework which allows to encode any subdivision of an n-D orientable quasi-manifold with or without boundaries. Combinatorial pyramids are defined as stacks of successively reduced combinatorial maps. Such pyramids provide a rich framework which allows to encode fine properties of the objects (either shapes or partitions). Combinatorial pyramids have first b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003